Counting 1324-Avoiding Permutations
نویسندگان
چکیده
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program provides data for the number of 1324-avoiding permutations of length up to 20.
منابع مشابه
On the growth rate of 1324-avoiding permutations
We give an improved algorithm for counting the number of 1324-avoiding permutations, resulting in 5 further terms of the generating function. We analyse the known coefficients and find compelling evidence that unlike other classical length-4 patternavoiding permutations, the generating function in this case does not have an algebraic singularity. Rather, the number of 1324-avoiding permutations...
متن کاملOn permutations which are 1324 and 2143 avoiding
We consider permutations which are 1324 and 2143 avoiding, where 2143 avoiding means that it is 2143 avoiding with the additional Bruhat restriction {2 ↔ 3}. In particular, for every permutation π we will construct a linear map Lπ and a labeled graph Gπ and will show that the following three conditions are equivalent: π is 1324 and 2143 avoiding; Lπ is onto; Gπ is a forest. We will also give so...
متن کاملA New Upper Bound for 1324-Avoiding Permutations
We prove that the number of 1324-avoiding permutations of length n is less than (7 + 4 √ 3). The novelty of our method is that we injectively encode such permutations by a pair of words of length n over a finite alphabet that avoid a given factor.
متن کاملA New Record for 1324-avoiding Permutations
We prove that the class of 1324-avoiding permutations has exponential growth rate at most 13.74. To Richard Stanley, on the occasion of his seventieth birthday.
متن کاملUsing functional equations to enumerate 1324-avoiding permutations
We consider the problem of enumerating permutations with exactly r occurrences of the pattern 1324 and derive functional equations for this general case as well as for the pattern avoidance (r = 0) case. The functional equations lead to a new algorithm for enumerating length n permutations that avoid 1324. This approach is used to enumerate the 1324-avoiders up to n = 31. We also extend those f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره on شماره
صفحات -
تاریخ انتشار 2002